Knowledge-Based Stable Roommates Problem: A Real-World Application

Abstract The Stable Roommates problem with Ties and Incomplete lists (SRTI) is a matching characterized by the preferences of agents over other as roommates, where may have ties or be incomplete. SRTI asks for that stable and, sometimes, optimizes domain-independent fairness criterion (e.g. Egalitarian). However, in real-world applications assigning students roommates at dormitory), we usually consider variety domain-specific criteria depending on habits desires agents. With this motivation, introduce knowledge-based method to considering knowledge investigate its application university dormitory.